package com.ljj.leetcode;

import java.util.HashMap;
import java.util.Map;

public class LeetCode {

    public static void main(String[] args) {
        double num =999;
        Double result=(num*0.3);

        System.err.println(result.longValue());
        System.err.println(result);
    }
    private static int[] twoSum(int[] nums,int target){
        Map<Integer,Integer> map=new HashMap<>();
        for (int i=0 ; i<nums.length;i++){
            if (map.containsKey(target-nums[i])){
                return new int[]{i,map.get(target-nums[i])};
            }
            map.put(nums[i],i);
        }
        return new int[0];
    }
}
